Query processing on tensor computation runtimes
نویسندگان
چکیده
The huge demand for computation in artificial intelligence (AI) is driving unparalleled investments hardware and software systems AI. This leads to an explosion the number of specialized devices, which are now offered by major cloud vendors. By hiding low-level complexity through a tensor-based interface, tensor runtimes (TCRs) such as PyTorch allow data scientists efficiently exploit exciting capabilities new hardware. In this paper, we explore how database management can ride wave innovation happening AI space. We design, build, evaluate Tensor Query Processor (TQP): TQP transforms SQL queries into programs executes them on TCRs. able run full TPC-H benchmark implementing novel algorithms relational operators routines. At same time, support various while only requiring fraction usual development effort. Experiments show that improve query execution time up 10$\times$ over CPU- GPU-only systems. Finally, accelerate mixing ML predictions end-to-end, deliver 9$\times$ speedup CPU baselines.
منابع مشابه
Declarative Query Processing in Imperative Managed Runtimes
The falling price of main memory has led to the development and growth of in-memory databases. At the same time, new advances in memory technology, like persistent memory, make it possible to have a truly universal storage model, accessed directly through the programming language in the context of a fully managed runtime. This environment is further enhanced by language-integrated query, which ...
متن کاملEfficient query processing in managed runtimes
This thesis presents strategies to improve the query evaluation performance over huge volumes of relational-like data that is stored in the memory space of managed applications. Storing and processing application data in the memory space of managed applications is motivated by the convergence of two recent trends in data management. First, dropping DRAM prices have led to memory capacities that...
متن کاملCode Generation for Efficient Query Processing in Managed Runtimes
In this paper we examine opportunities arising from the convergence of two trends in data management: in-memory database systems (IMDBs), which have received renewed attention following the availability of affordable, very large main memory systems; and language-integrated query, which transparently integrates database queries with programming languages (thus addressing the famous ‘impedance mi...
متن کاملPrivacy-Preserving Query Processing by Multi-Party Computation
Privacy-preserving query processing (P 3Q) techniques are increasingly important on partitioned databases, where relational queries have to be executed on horizontal data partitions held by different data owners. To conduct queries on the entire data partitions, the data owners may jointly collaborate to one another for sharing their private data or delegate them to an external service provider...
متن کاملFast stray field computation on tensor grids
A direct integration algorithm is described to compute the magnetostatic field and energy for given magnetization distributions on not necessarily uniform tensor grids. We use an analytically-based tensor approximation approach for function-related tensors, which reduces calculations to multilinear algebra operations. The algorithm scales with N4/3 for N computational cells used and with N2/3 (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2022
ISSN: ['2150-8097']
DOI: https://doi.org/10.14778/3551793.3551833